On Repetition-Free Binary Words of Minimal Density
نویسندگان
چکیده
منابع مشابه
Letter frequency in infinite repetition-free words
We estimate the extremal letter frequency in infinite words over a finite alphabet avoiding some repetitions. For ternary square-free words, we improve the bounds of Tarannikov on the minimal letter frequency, and prove that the maximal letter frequency is 255 653 . Kolpakov et al. have studied the function ρ such that ρ(x) is the minimal letter frequency in an infinite binary x-free word. In p...
متن کاملThe minimal density of a letter in an infinite ternary square - free word is 0 . 2746
We study the minimal density of letters in infinite square-free words. First, we give some definitions of minimal density in infinite words and prove their equivalence. Further, we propose a method that allows to strongly reduce an exhaustive search for obtaining lower bounds for minimal density. Next, we develop a technique for constructing square-free morphisms with extremely small density fo...
متن کاملCyclically repetition-free words on small alphabets
All sufficiently long binary words contain a square but there are infinite binary words having only the short squares 00, 11 and 0101. Recently it was shown by J. Currie that there exist cyclically square-free words in a ternary alphabet except for lengths 5, 7, 9, 10, 14, and 17. We consider binary words all conjugates of which contain only short squares. We show that the number c(n) of these ...
متن کاملPolynomial versus exponential growth in repetition-free binary words
It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 73 . More precisely, there are only polynomially many binary words of length n that avoid 7 3 -powers, but there are exponentially many binary words of length n that avo...
متن کاملConstructing Premaximal Binary Cube-Free Words of any Level
The study of repetition-free words and languages remains quite popular in combinatorics of words: lots of interesting and challenging problems are still open. The most popular repetition-free binary languages are the cube-free language CF and the overlap-free language OF. The language CF is much bigger and has much more complicated structure. For example, the number of overlap-free binary words...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998